1 |
complete graphA complete graph with n vertices (denoted Kn) is a graph with n vertices in which each vertex is connected to each of the others (with one edge between each pair of vertices). Here are the first five complete graphs:
|
2 |
complete graph
(graph theory) A graph where every pair of vertices is connected by an edge.
|
<< transient tracers | cut vertex >> |